On Valid Inequalities for Mixed Integer p-Order Cone Programming
نویسندگان
چکیده
We discuss two families of valid inequalities for linear mixed integer programming problems with cone constraints of arbitrary order, which arise in the context of stochastic optimization with downside risk measures. In particular, we extend the results of Atamtürk and Narayanan (Math. Program., 2010, 2011), who developed mixed integer rounding cuts and lifted cuts for mixed integer programming problems with second order cone constraints. Numerical experiments conducted on randomly generated problems and portfolio optimization problems with historical data demonstrate the effectiveness of the proposed methods.
منابع مشابه
Mixing mixed-integer inequalities
Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixed-integer region S and a collection of valid \base" mixed-integer inequalities , we develop a procedure for generating new val...
متن کاملTwo-Term Disjunctions on the Second-Order Cone
Balas introduced disjunctive cuts in the 1970s for mixed-integer linear programs. Several recent papers have attempted to extend this work to mixedinteger conic programs. In this paper we study the structure of the convex hull of a two-term disjunction applied to the second-order cone, and develop a methodology to derive closed-form expressions for convex inequalities describing the resulting c...
متن کاملOn Minimal Valid Inequalities for Mixed Integer Conic Programs
We study mixed integer conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce K-minimal inequalities and show that under mild assumptions, these inequalities together with the trivial cone-implied inequalities are sufficient to describe...
متن کامل9811 Mixing Mixed - Integer Inequalities
Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixed-integer region S and a collection of valid “base” mixed-integer inequalities, we develop a procedure for generating new vali...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 160 شماره
صفحات -
تاریخ انتشار 2014